import java.util.ArrayList;
import java.util.List;

/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 石方旭
 * Date: 2022-05-14
 * Time: 14:43
 */


//class Solution {
//    static {
//        ArrayList<Integer> list = new ArrayList<>();
//    }
//    public List<Integer> preorderTraversal(TreeNode root) {
//        if(root==null){
//            return null;
//        }
//        list.add(root.val);
//        preorderTraversal(root.left);
//        preorderTraversal(root.right);
//        return list;
//    }
//}


public class TestDemo {

    public static void main(String[] args) {
        BinaryTree binaryTree = new BinaryTree();
        BinaryTree.TreeNode root = binaryTree.createTree();
//        binaryTree.preOrder(root);
//        System.out.println();
//        binaryTree.inOrder(root);
//        System.out.println();
//        binaryTree.postOrder(root);
//        System.out.println();
        //System.out.println(binaryTree.getHeight(root));
        //binaryTree root= binaryTree.find(root,'B');
        binaryTree.levelOrder(root);
    }
}
